منابع مشابه
Uncommon Suffix Tries
Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a lnn height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to lnn. Both are built from VLMC (Variable Length Markov Chain) probabilistic sources and are easily extende...
متن کاملUpdating Reduced Implicate Tries
The reduced implicate trie, introduced in [11], is a data structure that may be used as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base. The knowledge compilation paradigm typically as...
متن کاملReduced Implicant Tries
The goal of knowledge compilation is to enable fast queries. Such queries are often in the form of conjunctive normal form (CNF) clauses, and the query amounts to the question of whether the clause is implied by the knowledge base. Here, we consider the dual type of query which is a DNF clause; the query then amounts to the question of whether the knowledge base is implied by the clause. Prior ...
متن کاملCompact Balanced Tries
summary by Mireille R egnier] Classical B?trees and preex B?trees 1] ooer both fast, direct addressing and easy sequential processing. They are balanced, segmented, and exible. Flexibility means that a B?tree leaf splitting may be done at any position inside the leaf. This property is emphasised: one generates and suppresses empty leaves, while forcing the other leaves to a 100% storage utilisa...
متن کاملProfile of Tries
Tries (from retrieval) are one of the most popular data structures on words. They are pertinent to (internal) structure of stored words and several splitting procedures used in diverse contexts. The profile of a trie is a parameter that represents the number of nodes (either internal or external) with the same distance to the root. It is a function of the number of strings stored in a trie and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: College & Research Libraries News
سال: 1992
ISSN: 2150-6698,0099-0086
DOI: 10.5860/crln.53.7.464